Decision As Abduction?
نویسنده
چکیده
In this article, we describe an abductive representation of decision problems under uncertainty based on ATMS. Firstly, we extend the ATMS framework so as to include , in addition to the usual assumption symbols, preference and decision symbols. Then we show how this framework can be further extended, by allowing to assign multiple (real or qualitative) values to assumption and preference symbols, for modeling gradual uncertainty and preferences, respectively. Two extensions are described, agreeing respectively with two non-classical decision theories.
منابع مشابه
Towards Practical Tabled Abduction Usable in Decision Making
Abduction as reasoning paradigm has been much explored in Artificial Intelligence, but not yet taken up by decision making as much as its potential warrants. Indeed, abduction permits the generation of hypothetical knowledge based scenarios, about which one can then equate decisions. One reason for this state of affairs is that abduction is difficult to implement efficaciously, even by experts,...
متن کاملLearning, Bayesian Probability, Graphical Models, and Abduction 1
In this chapter I review Bayesian statistics as used for induction and relate it to logic-based abduction. Much reasoning under uncertainty , including induction, is based on Bayes' rule. Bayes' rule is interesting precisely because it provides a mechanism for abduction. I review work of Buntine that argues that much of the work on Bayesian learning can be best viewed in terms of graphical mode...
متن کاملLearning Bayesian Probability Graphical Models and Abduction
In this chapter I review Bayesian statistics as used for induction and relate it to logic based abduction Much reasoning under un certainty including induction is based on Bayes rule Bayes rule is interesting precisely because it provides a mechanism for abduc tion I review work of Buntine that argues that much of the work on Bayesian learning can be best viewed in terms of graphical models suc...
متن کاملAbduction Framework for Repairing Incomplete EL Ontologies: Complexity Results and Algorithms
In this paper we consider the problem of repairing missing is-a relations in ontologies. We formalize the problem as a generalized TBox abduction problem (GTAP). Based on this abduction framework, we present complexity results for the existence, relevance and necessity decision problems for the GTAP with and without some specific preference relations for ontologies that can be represented using...
متن کاملCounting Complexity of Propositional Abduction
Abduction is an important method of non-monotonic reasoning with many applications in AI and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. Decision problems of great interest are the existence and the relevance problems. The complexity of these decision problems has been systematically studied while ...
متن کاملBayesian inference for statistical abduction using Markov chain Monte Carlo
Abduction is one of the basic logical inferences (deduction, induction and abduction) and derives the best explanations for our observation. Statistical abduction attempts to define a probability distribution over explanations and to evaluate them by their probabilities. The framework of statistical abduction is general since many well-known probabilistic models, i.e., BNs, HMMs and PCFGs, are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998